Solving Winner Determination Problem in Double Combinatorial Auction by ICA in Cloud Computing
نویسندگان
چکیده
There are many different ways to allocate resources in cloud computing. The economic methods are some of common ways to resource allocation. The auction-based method has some advantages compared with Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. Resource allocation in double combinatorial auction includes two phases. These two phases are winner determination and resource allocation. The proposed algorithm has implemented ICA to determine winner in double combinatorial auction-based resource allocation. The experimental results showed that in proposed algorithm the number of winner users is higher in proposed algorithm, but the number of winner providers is higher in genetic algorithm.
منابع مشابه
Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملCombinatorial Double Auction Winner Determination in Cloud Computing using Hybrid Genetic and Simulated Annealing Algorithm
With the advancement of information technology need to perform computing tasks everywhere and all the time there, in cloud computing environments and heterogeneous users have access to different sources with different characteristics that these resources are geographically in different areas. Due to this, the allocation of resources in cloud computing comes to the main issue is considered a maj...
متن کاملDouble Combinatorial Auction based Resource Allocation in Cloud Computing by Combinational using of ICA and Genetic Algorithms
Computational resources have become cheaper, more powerful and accessible than ever with the development of processing and strong technology and internet success. This technology has realized a new computing model called cloud computing in which resources are provided as a service to users and users can rent them or rent of them based on their demands. One of the problems with cloud computing i...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملEffects of Approximation on an Iterative Combinatorial Auction
HARISH G KAMMANAHALLI. Effects of Approximation on an Iterative Combinatorial Auction. (Under the direction of Dr Ṗeter Wurman.) Combinatorial auctions are a promising way of solving the complicated heterogeneous resource allocation problem. However combinatorial auctions present inherently hard computational problems for agents and auctioneers. In particular (1) the auction must solve the winn...
متن کامل